Hybrid Load-Value Predictors
نویسندگان
چکیده
Microprocessors are becoming faster at such a rapid pace that memory systems cannot keep up. As a result, the relative latency of load instructions grows constantly and already impedes processor pe rformance. Load value predictors alleviate this problem by allowing the CPU to speculatively continue processing without having to wait for load instructions to co mplete, which can significantly improve the execution speed. While several hybrid load value predictors have been proposed and found to work well, n o systematic study of such predictors has been performed to date. In this paper, we investigate the perfor mance of all hybrids that can be built out of a register value, a last value, a stride 2 -delta, a last four value, and a finite context method predic tor. Our analysis shows that hybrids can deliver 25% more speedup than the best single -component predictors. Analyzing the individual comp onents of hybrids revealed that predictors with a poor standalone performance sometimes make excellent components while combining well -performing individual predictors often does not result in an effe ctive hybrid. Moreover, adding components to a hybrid sometimes worsens the performance. Our hybridization study identified the register value + stride 2-delta predictor as one of the best twocomponent hybrids. It matches or exceeds the speedup of two-component hybrids from the literature in spite of its substantially smaller and simpler design. Of all the predictors we studied, the register value + stride 2 -delta + last four value hybrid performs best. It yields a harmonic -mean speedup over the eight SPECint95 programs of 13.6% to 17.2%.
منابع مشابه
Exploiting Type Information in Load-Value Predictors
To alleviate the high cost of main-memory accesses, computer architects have proposed various speculation mechanisms, including load-value prediction. A loadvalue predictor forecasts the result of load instructions, thus allowing dependent instructions to execute without having to wait for the memory access to complete. Unfortunately, costly mispredictions hinder the true potential of load-valu...
متن کاملImproving Context-Based Load Value Prediction
Microprocessors are becoming faster at such a rapid pace that other components like random access memory cannot keep up. As a result, the latency of load instructions grows constantly and already often impedes processor performance. Fortunately, load instructions frequently fetch predictable sequences of values. Load value predictors exploit this behavior to predict the results of load instruct...
متن کاملType-Based Load-Value Prediction
To alleviate the high cost of main-memory accesses, computer architects have proposed various speculation mechanisms, including load-value prediction. A load-value predictor guesses the result of load instructions, thus allowing dependent instructions to execute without having to wait for the memory access to complete. Unfortunately, costly mispredictions hinder the true potential of load-value...
متن کاملHybridizing and Coalescing Load Value Predictors
∗ now at Cornell University Abstract Most well-performing load value predictors are hybrids that combine multiple predictors into one. Such hybrids are often large. To reduce their size and to improve their performance, this paper presents two storage reduction techniques as well as a detailed analysis of the interaction between a hybrid’s components. We found that state sharing and simple valu...
متن کاملOn Compiler Support for Value Prediction
Load-value prediction increases the instruction-level parallelism in programs by allowing loads to execute in parallel with dependent instructions. Two major factors determine the performance of a load-value predictor: (i) the speedup from correct predictions and (ii) the slowdown from incorrect predictions. Modern predictors try to address both factors by using hybrid techniques and by incorpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 51 شماره
صفحات -
تاریخ انتشار 2002